Querying Optimal Routes for Group Meetup

Abstract Motivated by location-based social networks which allow people to access services as a group, we study novel variant of optimal sequenced route ( OSR ) queries, for group meetup (OSR-G) queries. OSR-G query aims find the meeting POI (point interest) such that maximum users’ distance is minimized after each user visits number POIs specific categories (e.g., gas stations, restaurants, and shopping malls) in particular order. To process first propose an OSR-Based OSRB algorithm our baseline, examines every category utilizes existing (called E-OSR compute POI. address shortcomings (i.e., requiring examine category) , upper bound based filtering algorithm, called circle CF exploits property filter unpromising POIs. In addition, lower pruning LBP namely LBP-SP shortest path prune unqualified reduce search space. Furthermore, develop approximate APS, accelerate queries with good approximation ratio. Finally experimental results show both outperform have high rates. Moreover, proposed runs faster than exact algorithms has